A Current Status of Thai Categorial Grammars and Their Applications
نویسندگان
چکیده
This paper presents a current status of Thai resources and tools for CG development. We also proposed a Thai categorial dependency grammar (CDG), an extended version of CG which includes dependency analysis into CG notation. Beside, an idea of how to group a word that has the same functions are presented to gain a certain type of category per word. We also discuss about a difficulty of building treebank and mention a toolkit for assisting on a Thai CGs tree building and a tree format representations. In this paper, we also give a summary of applications related to Thai CGs.
منابع مشابه
Categorial Unification Grammars
Categorial unification grammars (CUGs) embody the essential properties of both unification and categorial grammar formalisms. Their efficient and uniform way of encoding linguistic knowledge in well-understood and widely used representations makes them attractive for computational applications and for linguistic research. In this paper, the basic concepts of CUGs and simple examples of their ap...
متن کاملA Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
This paper solves a natural but still open question: can Abstract Categorial Grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that Non-Associative Lambek grammars as well as their derivations can be defined using ACGs of order ...
متن کاملPrediction in Chart Parsing Algorithms for Categorial Unification Grammar
Natural language systems based on Categorial Unification Grammar (CUG) have mainly employed bottomup parsing algorithms for processing. Conventional prediction techniques to improve the efficiency of the • parsing process, appear to fall short when parsing CUG. Nevertheless, prediction seems necessary when parsing grammars with highly ambiguous lexicons or with noncanonical categorial rules. In...
متن کاملCombinatory Categorial Grammars: Generative Power and Relationship to Linear Context-Free Rewriting Systems
Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammm~, Head Grammars, and Linear Indexed Grammars. In this paper we show that Combinatory Categorial Grammars also generates the same class of languages. We discuss the slruclm'al descriptions produced by Combi...
متن کاملSyntactic categories and types: Ajdukiewicz and modern categorial grammars
This essay confronts Ajdukiewicz’s approach to syntactic categories with modern categorial grammars, mainly AB-grammars (basic categorial grammars) and Lambek grammars, i.e. categorial grammars based on different versions of the Lambek calculus.
متن کامل